any non-empty string

См. также в других словарях:

• String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… …   Wikipedia

• Non-standard cosmology — Physical cosmology Universe · Big Bang …   Wikipedia

• Comparison of programming languages (string functions) — String functions redirects here. For string functions in formal language theory, see String operations. Programming language comparisons General comparison Basic syntax Basic instructions Arrays …   Wikipedia

• Non-canonical works related and derived from Sherlock Holmes — Sherlock Holmes has long been a popular character for authors and creatives other than Arthur Conan Doyle. Their works can be grouped into four broad categories: new Sherlock Holmes stories; stories in which Holmes appears in a cameo role;… …   Wikipedia

• Non-canonical Sherlock Holmes works — Sherlock Holmes has long been a popular character for authors and creators other than Arthur Conan Doyle. Their works can be grouped into four broad categories: new Sherlock Holmes stories; stories in which Holmes appears in a cameo role; stories …   Wikipedia

• Windows Registry — The Windows Registry is a hierarchical database that stores configuration settings and options on Microsoft Windows operating systems. It contains settings for low level operating system components as well as the applications running on the… …   Wikipedia

• Uniform Resource Identifier — In computing, a Uniform Resource Identifier (URI) is a compact string of characters used to identify or name a resource on the Internet. The main purpose of this identification is to enable interaction with representations of the resource over a… …   Wikipedia

• Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

• Comparison of layout engines (Document Object Model) — The following tables compare DOM compatibility and support for a number of layout engines. Please see the individual products articles for further information. This article is not all inclusive or necessarily up to date. Unless otherwise… …   Wikipedia

• Simply connected space — In topology, a topological space is called simply connected (or 1 connected) if it is path connected and every path between two points can be continuously transformed, staying within the space, into any other path while preserving the two… …   Wikipedia

• Graftal — A graftal or L system is a formal grammar used in computer graphics to recursively define branching tree and plant shapes in a compact format. The shape is defined by a string of symbols constructed by a graftal grammar. A graftal grammar… …   Wikipedia